5 F eb 2 00 9 The Internally 4 - Connected Binary Matroids With No M ( K 3 , 3 ) - Minor . Dillon Mayhew Gordon Royle
نویسندگان
چکیده
We give a characterization of the internally 4-connected binary matroids that have no minor isomorphic to M(K3,3). Any such matroid is either cographic, or is isomorphic to a particular single-element extension of the bond matroid of a cubic or quartic Möbius ladder, or is isomorphic to one of eighteen sporadic matroids. 2000 Mathematics Subject Classification. 05B35.
منابع مشابه
Excluding Kuratowski graphs and their duals from binary matroids
We consider various applications of our characterization of the internally 4-connected binary matroids with no M(K3,3)-minor. In particular, we characterize the internally 4-connected members of those classes of binary matroids produced by excluding any collection of cycle and bond matroids of K3,3 and K5, as long as that collection contains either M(K3,3) or M ∗(K3,3). We also present polynomi...
متن کاملMaximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic
We prove that the maximum size of a simple binary matroid of rank r ≥ 5 with no AG(3, 2)-minor is (r+1 2 ) and characterize those matroids achieving this bound. When r ≥ 6, the graphic matroid M(Kr+1) is the unique matroid meeting the bound, but there are a handful of matroids of lower ranks meeting or exceeding this bound. In addition, we determine the size function for nongraphic simple binar...
متن کاملA chain theorem for internally 4-connected binary matroids
Let M be a matroid. When M is 3-connected, Tutte’s WheelsandWhirls Theorem proves that M has a 3-connected proper minor N with exactly one element fewer than M unless M is a wheel or a whirl. I will present a corresponding result for internally 4-connected binary matroids. This presentation is based on joint work by myself, Dillon Mayhew, and James Oxley.
متن کاملTowards a splitter theorem for internally 4-connected binary matroids II
Let M and N be internally 4-connected binary matroids such that M has a proper N -minor, and |E(N)| ≥ 7. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following result: if M\e has no N -minor whenever e is in a triangle of M , and M/e has no N -minor whenever e is in a triad of M , then M has a minor, M ′, such that M ′ is internal...
متن کاملA Decomposition Theorem for Binary Matroids with no Prism Minor
The prism graph is the dual of the complete graph on five vertices with an edge deleted, K5\e. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by Dirac where he identified the simple 3-connected graphs with no minor isomorphic to the prism graph. We prove that besides Dirac’s infinite families of graphs and four inf...
متن کامل